Segmental K-Means Learning with Mixture Distribution for HMM Based Handwriting Recognition
نویسندگان
چکیده
This paper investigates the performance of hidden Markov models (HMMs) for handwriting recognition. The Segmental K-Means algorithm is used for updating the transition and observation probabilities, instead of the Baum-Welch algorithm. Observation probabilities are modelled as multi-variate Gaussian mixture distributions. A deterministic clustering technique is used to estimate the initial parameters of an HMM. Bayesian information criterion (BIC) is used to select the topology of the model. The wavelet transform is used to extract features from a grey-scale image, and avoids binarization of the image.
منابع مشابه
Off-line Arabic Handwritten Recognition Using a Novel Hybrid HMM-DNN Model
In order to facilitate the entry of data into the computer and its digitalization, automatic recognition of printed texts and manuscripts is one of the considerable aid to many applications. Research on automatic document recognition started decades ago with the recognition of isolated digits and letters, and today, due to advancements in machine learning methods, efforts are being made to iden...
متن کاملBayesian adaptive learning of the parameters of hidden Markov model for speech recognition
In this paper a theoretical framework for Bayesian adaptive learning of discrete HMM and semi continuous one with Gaussian mixture state observation densities is presented Corre sponding to the well known Baum Welch and segmental k means algorithms respectively for HMM training formulations of MAP maximum a posteriori and segmental MAP estima tion of HMM parameters are developed Furthermore a c...
متن کاملWriter adaptation of a HMM handwriting recognition system
This paper describes a scheme to adapt the parameters of a tied-mixture, hidden Markov model, on-line handwriting recognition system to improve performance on new writers' handwriting. The means and variances of the distributions are adapted using the Maximum Likelihood Linear Regression technique [1,2]. Experiments are performed with a number of new writers in both supervised and unsupervised ...
متن کاملMaximum a posteriori estimation for multivariate Gaussian mixture observations of Markov chains
In this paper a framework for maximum a posteriori (MAP) estimation of hidden Markov models (HMM) is presented. Three key issues of MAP estimation, namely the choice of prior distribution family, the specification of the parameters of prior densities and the evaluation of the MAP estimates, are addressed. Using HMMs with Gaussian mixture state observation densities as an example, it is assumed ...
متن کاملMAP Estimation of Continuous Density HMM : Theory and Applications
We discuss maximum a posteriori estimation of continuous density hidden Markov models (CDHMM). The classical MLE reestimation algorithms, namely the forward-backward algorithm and the segmental k-means algorithm, are expanded and reestimation formulas are given for HMM with Gaussian mixture observation densities. Because of its adaptive nature, Bayesian learning serves as a unified approach for...
متن کامل